Real root finding for low rank linear matrices
نویسندگان
چکیده
منابع مشابه
Real root finding for low rank linear matrices
The problem of finding low rank m × m matrices in a real affine subspace of dimension n has many applications in information and systems theory, where low rank is synonymous of structure and parcimony. We design a symbolic computation algorithm to solve this problem efficiently, exactly and rigorously: the input are the rational coefficients of the matrices spanning the affine subspace as well ...
متن کاملReal root finding for determinants of linear matrices
Let A0, A1, . . . , An be given square matrices of size m with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety {x ∈ Rn : det(A0 +x1A1 + · · ·+xnAn) = 0}. Such a problem finds applications in many areas such as control theory, computational geometry, optimization, etc. Using standard complexity results t...
متن کاملCommutative/noncommutative Rank of Linear Matrices and Subspaces of Matrices of Low Rank
A space of matrix of low rank is a vector space of rectangular matrices whose maximum rank is stricly smaller than the number of rows and the numbers of columns. Among these are the compression spaces, where the rank condition is garanteed by a rectangular hole of 0’s of appropriate size. Spaces of matrices are naturally encoded by linear matrices. The latter have a double existence: over the r...
متن کاملSome rank equalities for finitely many tripotent matrices
A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations. Moreover, by using this equality and Theorems 8 and 10 in [Chen M. and et al. On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications, The Scientific World Journal 2014 (2014), Article ID 702413, 7 page...
متن کاملLow-rank Matrices with Missing Data
A technique for building consistent 3D reconstructions from many views based on fitting a low rank matrix to a matrix with missing data is presented. Rank-four submatrices of minimal, or slightly larger, size are sampled and spans of their columns are combined to constrain a basis of the fitted matrix. The error minimized is expressed in terms of the original subspaces which leads to a better r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 2019
ISSN: 0938-1279,1432-0622
DOI: 10.1007/s00200-019-00396-w